A fractal set from the binary reflected Gray code
نویسندگان
چکیده
منابع مشابه
A fractal set from the binary reflected Gray code
The permutation associated with the decimal expression of the binary reflected Gray code with N bits is considered. Its cycle structure is studied. Considered as a set of points, its self-similarity is pointed out. As a fractal, it is shown to be the attractor of a IFS. For large values of N the set is examined from the point of view of time series analysis. PACS numbers: 05.45 Df, 05.45 Tp AMS...
متن کاملOn the Conversion between Binary Code and Binary-Reflected Gray Code on Boolean Cubes
We present a new algorithm for conversion between binary code and binary{re ected Gray code that requires approximately 2K 3 element transfers in sequence for K elements per node, compared to K element transfers for previously known algorithms. For a binary cube of n = 2 dimensions the new algorithm degenerates to yield a complexity of K 2 + 1 element transfers, which is optimal. The new algori...
متن کاملParallel binary reflected Gray code sequence generation on multicore architectures
Taylor & Francis makes every effort to ensure the accuracy of all the information (the “Content”) contained in the publications on our platform. However, Taylor & Francis, our agents, and our licensors make no representations or warranties whatsoever as to the accuracy, completeness, or suitability for any purpose of the Content. Any opinions and views expressed in this publication are the opin...
متن کاملA Dynamic Programming Approach to Generating a Binary Reflected Gray Code Sequence
A binary reflected Gray code (Gray code for short) is a one-to-one function G(i) of the integers 0 • i • 2 – 1 (for some pre-selected value of n) to binary numbers such that the binary number for G(i) and G(i+1) differ in exactly one bit. For example, with N = 3, the Gray codes (written in binary) are 000, 001, 011, 010, 110, 111, 101, 100. In this paper, we describe a dynamic programming algor...
متن کاملOn binary reflected Gray codes and functions
The Binary Reflected Gray Code function b is defined as follows: If m is a nonnegative integer, then b(m) is the integer obtained when initial zeros are omitted from the binary reflected Gray code of length m. This paper examines this Gray code function and its inverse and gives simple algorithms to generate both. It also simplifies Conder’s result that the jth letter of the kth word of the bin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A: Mathematical and General
سال: 2005
ISSN: 0305-4470,1361-6447
DOI: 10.1088/0305-4470/38/41/007